type go/token.node

35 uses

	go/token (current package)
		tree.go#L36: 	root *node
		tree.go#L39: type node struct {
		tree.go#L41: 	parent  *node
		tree.go#L42: 	left    *node
		tree.go#L43: 	right   *node
		tree.go#L78: func (n *node) check(parent *node) {
		tree.go#L93: func (n *node) checkBalance() {
		tree.go#L112: func (t *tree) locate(k key) (pos **node, parent *node) {
		tree.go#L156: func (t *tree) nextAfter(pos **node, parent *node) *node {
		tree.go#L169: func (x *node) next() *node {
		tree.go#L183: func (t *tree) setRoot(x *node) {
		tree.go#L190: func (x *node) setLeft(y *node) {
		tree.go#L197: func (x *node) setRight(y *node) {
		tree.go#L204: func (n *node) safeHeight() int32 {
		tree.go#L211: func (n *node) update() {
		tree.go#L217: func (t *tree) replaceChild(parent, old, new *node) {
		tree.go#L239: func (t *tree) rebalanceUp(x *node) {
		tree.go#L268: func (t *tree) rotateRight(y *node) *node {
		tree.go#L288: func (t *tree) rotateLeft(x *node) *node {
		tree.go#L323: func (t *tree) set(file *File, pos **node, parent *node) {
		tree.go#L334: 	x := &node{file: file, key: file.key(), parent: parent, height: -1}
		tree.go#L340: func (t *tree) delete(pos **node) {
		tree.go#L379: func (t *tree) deleteSwap(pos **node) {
		tree.go#L400: func (t *tree) deleteMin(zpos **node) (z *node) {